FOCUSR: Feature Oriented Correspondence Using Spectral Regularization--A Method for Precise Surface Matching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Feature Correspondence Method using Bayesian Graph Matching Algorithm

In this paper, we propose a new approach for establishing the correspondence between local invariant features using Bayesian graph matching algorithm. First, we will discuss various local invariant feature detectors and descriptors for scale and affine transformation and illumination changes. Second, we propose an efficient features corresponding method using local invariant features and new gr...

متن کامل

A regularization method for solving a nonlinear backward inverse heat conduction problem using discrete mollification method

The present essay scrutinizes the application of discrete mollification as a filtering procedure to solve a nonlinear backward inverse heat conduction problem in one dimensional space. These problems are seriously ill-posed. So, we combine discrete mollification and space marching method to address the ill-posedness of the proposed problem. Moreover, a proof of stability and<b...

متن کامل

Spectral correspondence for point pattern matching

This paper investigates the correspondence matching of point-sets using spectral graph analysis. In particular, we are interested in the problem of how the modal analysis of point-sets can be rendered robust to contamination and drop-out. We make three contributions. First, we show how the modal structure of point-sets can be embedded within the framework of the EM algorithm. Second, we present...

متن کامل

A Graph-Spectral Approach to Correspondence Matching

This paper describes a spectral method for graphmatching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probability matrix of a Markov chain. The node-order of the steady state random walk associated with this Markov chain is determined by the co-efficent order of the leading eigenvector of the adjacency matrix. We match nodes in ...

متن کامل

Fast Correspondence Search for 3d Surface Matching

An algorithm for least squares matching of overlapping 3D surfaces is presented. It estimates the transformation parameters between two or more fully 3D surfaces, using the Generalized Gauss-Markoff model, minimizing the sum of squares of the Euclidean distances between the surfaces. This formulation gives the opportunity of matching arbitrarily oriented 3D surfaces simultaneously, without usin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence

سال: 2013

ISSN: 0162-8828,2160-9292

DOI: 10.1109/tpami.2012.276